Configuring Low Cost Metanetworks on A Shared Substrate

نویسندگان

  • Jing Lu
  • Jonathan Turner
چکیده

In a diversified internet, meta-networks (“metanets?for short) share a common substrate and offer value-added services to millions of users around the globe. Therefore, configuring low-cost metanets with links having enough bandwidth to accommodate all anticipated user traffic is critical to the success of the metanets. In this paper, we propose a novel pruning algorithm that configures metanets on any given substrate in a cost-efficient way. In contrast to other testbed configuration systems, we solve the metanet configuration problem from a higher level specification and produces a network that is dimensioned to handle the specified traffic. To the best of our knowledge, our work is also the first one that tries to automatically determine the best metanet topology while considering network switching costs and propagation delays. We study how the best topology changes on different substrate networks as traffic conditions vary. In general, we find that as pair-wise traffic constraints and delay bounds are relaxed, the least-cost metanet topology becomes increasingly “tree-like? We also show the impact of delay bounds on the network costs under different traffic conditions. Our algorithm produces metanet configurations that are demonstrably close to the computed lower bound and is fast enough to handle substrate networks of practical size. Type of Report: Other Department of Computer Science & Engineering Washington University in St. Louis Campus Box 1045 St. Louis, MO 63130 ph: (314) 935-6160 Configuring Low Cost Metanetworks on A Shared Substrate Jing Lu and Jonathan Turner Department of Computer Science and Engineering Washington University in St. Louis St. Louis, MO 63130 Email: {jl1, jst}@arl.wustl.edu Abstract— In a diversified internet, metanetworks (“metanets” for short) share a common substrate and offer value-added services to potentially large numbers of users around the globe. Therefore, configuring low-cost metanets with links having enough bandwidth to accommodate all anticipated user traffic is crucial to the success of the metanets. In this paper, we propose a novel pruning algorithm that configures metanets on any given substrate in a cost-efficient way. In contrast to other testbed configuration systems, we solve the metanet configuration problem from a higher level specification and produce a network that is dimensioned to handle the specified traffic. To the best of our knowledge, our work is also the first one that tries to automatically determine the best network topology while considering network switching costs and propagation delays. We study how the best topology changes on different substrates as traffic conditions vary. In general, we find that as pairwise traffic constraints and delay bounds are relaxed, the leastcost metanet topology becomes increasingly “tree-like”. We also show the impact of delay bounds on the network costs under different traffic conditions. Our algorithm produces metanet configurations that are demonstrably close to the computed lower bound and is fast enough to handle substrate networks of practical size. In a diversified internet, metanetworks (“metanets” for short) share a common substrate and offer value-added services to potentially large numbers of users around the globe. Therefore, configuring low-cost metanets with links having enough bandwidth to accommodate all anticipated user traffic is crucial to the success of the metanets. In this paper, we propose a novel pruning algorithm that configures metanets on any given substrate in a cost-efficient way. In contrast to other testbed configuration systems, we solve the metanet configuration problem from a higher level specification and produce a network that is dimensioned to handle the specified traffic. To the best of our knowledge, our work is also the first one that tries to automatically determine the best network topology while considering network switching costs and propagation delays. We study how the best topology changes on different substrates as traffic conditions vary. In general, we find that as pairwise traffic constraints and delay bounds are relaxed, the leastcost metanet topology becomes increasingly “tree-like”. We also show the impact of delay bounds on the network costs under different traffic conditions. Our algorithm produces metanet configurations that are demonstrably close to the computed lower bound and is fast enough to handle substrate networks of practical size.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Configuring Low Cost Metanetworks on A Shared Substrate

In a diversified internet, meta-networks (“metanets?for short) share a common substrate and offer value-added services to millions of users around the globe. Therefore, configuring low-cost metanets with links having enough bandwidth to accommodate all anticipated user traffic is critical to the success of the metanets. In this paper, we propose a novel pruning algorithm that configures metanet...

متن کامل

Metanetworks of artificially evolved regulatory networks

We study metanetworks arising in genotype and phenotype spaces, in the context of a model population of Boolean graphs evolved under selection for short dynamical attractors. We define the adjacency matrix of a graph as its genotype, which gets mutated in the course of evolution, while its phenotype is its set of dynamical attractors. Metanetworks in the genotype and phenotype spaces are formed...

متن کامل

Autonomic Resource Management in Virtual Networks

Virtualization enables the building of multiple virtual networks over a shared substrate. One of the challenges to virtualisation is efficient resource allocation. This problem has been found to be NP hard. Therefore, most approaches to it have not only proposed static solutions, but have also made many assumptions to simplify it. In this paper, we propose a distributed, autonomic and artificia...

متن کامل

Dual Band Slotted Patch Antenna for On/Off-body Communication

Body Centric Wireless Communication (BCWC) has been topic of much research in recent years. In this manuscript, a novel low-cost microstrip patch antenna is designed for on-/off-body communication with a dual-band operation. The proposed structure exhibits a monopole-like radiation pattern at 2.45 GHz and a broadside radiation at 4.8 GHz, simultaneously. Lateral dimensions of 42 mm × 46 mm and ...

متن کامل

Si/ZnO NANO STRUCTURED HETEROJUNCTIONS BY APCVD METHOD

In this paper, polycrystalline pure zinc oxide nano structured thin films were deposited on two kinds of single crystal and polycrystalline of p and n type Si in three different substrate temperatures of 300, 400 and 500◦C by low cost APCVD method. Structural, electrical and optical properties of these thin films were characterized by X ray diffraction, two point probe method and UV visible spe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009